Improved L0 Gradient Minimization with L1 Fidelity for Image Smoothing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved L0 Gradient Minimization with L1 Fidelity for Image Smoothing

Edge-preserving image smoothing is one of the fundamental tasks in the field of computer graphics and computer vision. Recently, L0 gradient minimization (LGM) has been proposed for this purpose. In contrast to the total variation (TV) model which employs the L1 norm of the image gradient, the LGM model adopts the L0 norm and yields much better results for the piecewise constant image. However,...

متن کامل

Image smoothing via L0 gradient minimization

We present a new image editing method, particularly effective for sharpening major edges by increasing the steepness of transition while eliminating a manageable degree of low-amplitude structures. The seemingly contradictive effect is achieved in an optimization framework making use of L0 gradient minimization, which can globally control how many non-zero gradients are resulted in to approxima...

متن کامل

A Hybrid L0-L1 Minimization Algorithm for Compressed Sensing MRI

INTRODUCTION Both L1 minimization [1] and homotopic L0 minimization [2] techniques have shown success in compressed-sensing MRI reconstruction using reduced k-space data. L1 minimization algorithm is known to usually shrink the magnitude of reconstructions especially for larger coefficients [1, 3] and non-convex penalty used in homotopic L0 minimization is advocated to replace L1 penalty [3]. H...

متن کامل

A Hybrid L0-L1 Minimization Algorithm for Compressed Sensing MRI

INTRODUCTION Both L1 minimization [1] and homotopic L0 minimization [2] techniques have shown success in compressed-sensing MRI reconstruction using reduced k-space data. L1 minimization algorithm is known to usually shrink the magnitude of reconstructions especially for larger coefficients [1, 3] and non-convex penalty used in homotopic L0 minimization is advocated to replace L1 penalty [3]. H...

متن کامل

Mixed l0/l1 Norm Minimization Approach to Super-Resolution

This deals with the problem of recovering a high-resolution digital image from one low resolution digital image and proposes a super-resolution algorithm based on the mixed l0/l1 norm minimization. Introducing some assumptions and focusing the uniformity and the gradation of the image, this paper formulates the colorization problem as a mixed l0/l1 norm minimization and proposes the algorithm b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2015

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0138682